Arc-Flags in Dynamic Graphs
نویسندگان
چکیده
Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several basic ingredients. However, not all of those ingredients have been analyzed in a dynamic scenario where edge weights change after preprocessing. In this work, we present how one of those ingredients, i.e., Arc-Flags can be applied in dynamic scenarios.
منابع مشابه
Dynamic Arc-Flags in Road Networks
In this work we introduce a new data structure, named RoadSigns, which allows us to efficiently update the Arc-Flags of a graph in a dynamic scenario. Road-Signs can be used to compute Arc-Flags, can be efficiently updated and do not require large space consumption for many real-world graphs like, e.g., graphs arising from road networks. In detail, we define an algorithm to preprocess Road-Sign...
متن کاملFast Point-to-Point Shortest Path Computations with Arc-Flags
We present a number of improvements of the basic variant of the arc-flag acceleration (Lauther, 1997, 2004) for point-to-point (P2P) shortest path computations on large graphs. Arc-flags are a modification to the standard Dijkstra algorithm and are used to avoid exploring unnecessary paths during shortest path computation. We assume that for the same input graph the shortest path problem has to...
متن کاملFully Dynamic Maintenance of Arc-Flags in Road Networks
The problem of finding best routes in road networks can be solved by applying Dijkstra’s shortest paths algorithm. Unfortunately, road networks deriving from real-world applications are huge yielding unsustainable times to compute shortest paths. For this reason, great research efforts have been done to accelerate Dijkstra’s algorithm on road networks. These efforts have led to the development ...
متن کاملUnitary Graphs
Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of arc-transitive graphs that admit an automorphism group acting imprimitively on the vertices. In this article, we prove that all unitary graphs are connected of diameter...
متن کاملValidity of Selected WBC Differentiation Flags in Sysmex XT-1800i
Background: Automatic Cell Counter devises make the CBC differential very easy and delivering the results in few second. However, the problem with this device is facing a flag requires a time-consuming microscopic review of the specimen which causes unacceptable wait times for patient as well as costs for laboratories. In this study, we calculated the validity of WBC d...
متن کامل